Stability of the Maximum Size Matching
نویسندگان
چکیده
Among scheduling algorithms used in input queued switches, it is known that the Maximum Size Matching (MSM) algorithm maximizes the instantaneous throughput. Although there have been results on the stability of some specific types of MSMs for scheduling traffic [5], the question of how it performs under uniform traffic remains open. Simulations suggest the stability of MSM algorithms under uniform traffic but there have been no analytical results proving the same. In this article, we introduce a new Lyapunov function in order to prove that under uniform arrival traffic MSM algorithm achieves 100% throughput and also to find a stability region for the arrival rates.
منابع مشابه
Matching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملA Numerical Analysis on the Performance of Counterweight Balance on the Stability of Undercut Slopes
One of the important parameters in undercut slopes design is the determination of the maximum stable undercut span. The maximum stable undercut span is a function of slope geometry, the strength parameters of the slope material, condition of discontinuities, underground water condition, etc. However, the desired production capacity and therefore the size of excavating equipment will sometimes a...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کامل